Computational Experience with Exploiting Order Variation in Mesh Refinement for Direct Transcription Methods
نویسندگان
چکیده
The numerical theory for Implicit Runge Kutta methods shows that there can be order reduction when these methods are applied to either stiff or differential algebraic equations. A previous paper introduced a way to try and compensate for this order reduction in designing mesh refinement strategies. This paper presents the results from a number of computational studies on the effectiveness of this approach. In addition we present a new test problem which can be used to examine the efficiency of codes developed for a particular class of applications.
منابع مشابه
An hr–adaptive discontinuous Galerkin method for advection–diffusion problems
We propose an adaptive mesh refinement strategy based on exploiting a combination of a pre–processing mesh re-distribution algorithm employing a harmonic mapping technique, and standard (isotropic) mesh subdivision for discontinuous Galerkin approximations of advection–diffusion problems. Numerical experiments indicate that the resulting adaptive strategy can efficiently reduce the computed dis...
متن کاملMesh Refinement in Direct Transcription Methods for Optimal Control
The direct transcription method for solving optimal control problems involves the use of a discrete approximation to the original problem. This paper describes a technique for changing the discretization in order to improve the accuracy of the approximation. An integer programming technique is used to minimize the maximum error during the refinement iterations. The efficiency of the method is i...
متن کاملThree Dimensional Discontinuous Galerkin Methods for Euler Equations on the Adaptive Consistent Meshes
In the numerical simulation of three dimensional fluid dynamical equations, the huge computational quantity is a main challenge problem. Based on the three dimensional consistent unstructured tetrahedron meshes, we study the discontinuous Galerkin (DG) finite element method [1] combined with the adaptive mesh refinement (AMR) [2, 3] for solving Euler equations in this paper. That is according t...
متن کاملFast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملParallel Implementation of Numerical Dissipation Rate and Viscosity Post-processing in Computational Fluid Dynamics
In simulations of Computational Fluid Dynamics (CFD), the numerical dissipation generated from discretization of governing equations can rarely be ignored. Estimating numerical dissipation rate and numerical viscosity is not only pressing for subgrid scale (SGS) modelling in Large Eddy Simulations (LES) and low order methods such as Finite Volume Method (FVM) in commerical codes, but also helpf...
متن کامل